Structure learning by pruning in independent component analysis
نویسندگان
چکیده
منابع مشابه
Rank based Least-squares Independent Component Analysis
In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...
متن کاملNeural independent component analysis by "maximum-mismatch" learning principle
The aim of the present paper is to apply Sudjanto-Hassoun theory of Hebbian learning to neural independent component analysis. The basic learning theory is first recalled and expanded in order to make it suitable for a network of non-linear complex-weighted neurons; then its interpretation and application is shown in the context of blind separation of complex-valued sources. Numerical results a...
متن کاملPost-nonlinear Independent Component Analysis by Variational Bayesian Learning
Post-nonlinear (PNL) independent component analysis (ICA) is a generalisation of ICA where the observations are assumed to have been generated from independent sources by linear mixing followed by component-wise scalar nonlinearities. Most previous PNL ICA algorithms require the post-nonlinearities to be invertible functions. In this paper, we present a variational Bayesian approach to PNL ICA ...
متن کاملIndependent component analysis by general nonlinear Hebbian-like learning rules
A number of neural learning rules have been recently proposed for independent component analysis (ICA). The rules are usually derived from information-theoretic criteria such as maximum entropy or minimum mutual information. In this paper, we show that in fact, ICA can be performed by very simple Hebbian or anti-Hebbian learning rules, which may have only weak relations to such information-theo...
متن کاملIndependent Component Analysis using Reinforcement Learning
Recently Fyfe has used the REINFORCE algorithm to create a variety of topology-preserving mappings and to create valid projections for principal component analysis and canonical correlation analysis. In this paper, we extend his results to the case of independent component analysis. We illustrate the basic method with a number of different reward functions and a number of artificial and real da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2008
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2007.09.016